On Spt-crank Type Functions
نویسندگان
چکیده
In a recent paper, Andrews, Dixit, and Yee introduced a new spt-type function spt ω (n), which is closely related to Ramanujan’s third order mock theta function ω(q). Garvan and Jennings-Shaffer introduce a crank function which explains congruences for spt ω (n). In this note, we study asymptotic behavior of this crank function and confirm a positivity conjecture of the crank asymptotically. We also study a sign pattern of the crank and congruences for spt ω (n).
منابع مشابه
Exotic Bailey-slater Spt-functions Ii: Hecke-rogers-type Double Sums and Bailey Pairs from Groups A, C, E
We continue to investigate spt-type functions that arise from Bailey pairs. We prove simple Ramanujan type congruences for these functions which can be explained by a spt-crank-type function. The spt-crank-type functions are constructed by adding an extra variable z into the generating functions. We find these generating functions to have interesting representations as either infinite products ...
متن کاملHigher Order Spt-functions
Andrews’ spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only known previously for sufficiently large n and...
متن کاملCombinatorial Interpretations of Congruences for the Spt-function
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. In 1988, the second author gave new combinatorial interpretations of Ramanujan’s partition congruences mod 5, 7 and 11 in terms of a crank for weighted vector partitions. In 2008, the first author found Ramanujantype congruences for the spt-function mod 5, 7 and 13. We give new combinatorial inte...
متن کاملOn the Distribution of the spt-Crank
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any n the sequence {NS(m,n)}m is unimodal, where NS(m,n) is the number of S-partitions of size n with crank m weight by the spt-crank. We relate this conjecture to a distributional result concerning the usual rank and crank of unrestricted partitions. This leads to a heuristic that suggests the conj...
متن کاملCongruences for Andrews’ Smallest Parts Partition Function and New Congruences for Dyson’s Rank
Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We prove a generalization of these congruences using known relations between rank and crank moments. We obtain an explicit Ramanujan-type congruence for spt(n) ...
متن کامل